Zero Assignment Problem in RLC Networks

نویسندگان

  • John Leventides
  • Maria Livada
  • Nicos Karcanias
چکیده

The paper deals with the problem of zero assignment in RLC networks by selection of appropriate values for the nondynamical elements, the resistors. For a certain family of network redesign problems by the additive perturbations may be described as diagonal perturbations and such modifications are considered here. This problem belongs to the family of DAP problems (Determinantal Assignment Problem) and has common features with the pole assignment problem by decentralized output feedback and the zero assignment problem via structured additive perturbations. We demonstrate that the sufficient condition for generic zero assignment by selecting the resistors holds true. This condition is related to the rank of the differential of the related map and holds true generically when the degrees of freedom of the matrix of resistors exceeds the number of frequencies to be assigned (n > p + q). Using this result, we show through a generic example that the sufficient condition for the general zero assignment problems in RLC networks is satisfied and thus, zero assignment can be achieved via resistor determination.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Receding learning-aided control in stochastic networks

In this paper, we develop the Receding Learning-aided Control algorithm (RLC) for solving optimizationproblems in general stochastic networks with potentially non-stationary system dynamics. RLC is alow-complexity online algorithm that requires zero a-priori statistical knowledge. It has three mainfunctionalities. First, it detects changes of the underlying distribution of syste...

متن کامل

A CSA Method for Assigning Client to Servers in Online Social Networks

This paper deals with the problem of user-server assignment in online social network systems. Online social network applications such as Facebook, Twitter, or Instagram are built on an infrastructure of servers that enables them to communicate with each other. A key factor that determines the facility of communication between the users and the servers is the Expected Transmission Time (ETT). A ...

متن کامل

Spectrum Assignment in Cognitive Radio Networks Using Fuzzy Logic Empowered Ants

The prevalent communications networks suffer from lack of spectrum and spectrum inefficiency. This has motivated researchers to develop cognitive radio (CR) as a smart and dynamic radio access promised solution. A major challenge to this new technology is how to make fair assignment of available spectrum to unlicensed users, particularly for smart grids communication. This paper introduces an i...

متن کامل

A New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks

In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...

متن کامل

Bus Assignment to Iranian Pilgrims During Pilgrimage

Among the multitude of activities of Hajj Organization which require careful planning bus assignment to the Iranian pilgrim caravans d g pilgrimage is the most important one. The objective of this assignment is to have a minimum number o standing passengers/empty seats, while satisfying a large number of operational and religious constrain. This problem was formulated as a large scale zero-one ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017